Computing zero deficiency realizations of kinetic systems
نویسندگان
چکیده
منابع مشابه
Computing zero deficiency realizations of kinetic systems
In the literature, there exist strong results on the qualitative dynamical properties of chemical reaction networks (also called kinetic systems) governed by the mass action law and having zero deficiency. However, it is known that different network structures with different deficiencies may correspond to the same kinetic differential equations. In this paper, an optimization-based approach is ...
متن کاملComputing all possible graph structures describing linearly conjugate realizations of kinetic systems
In this paper an algorithm is given to determine all possible structurally different linearly conjugate realizations of a given kinetic polynomial system. The solution is based on the iterative search for constrained dense realizations using linear programming. Since there might exist exponentially many different reaction graph structures, we cannot expect to have a polynomial-time algorithm, b...
متن کاملComputing reaction kinetic realizations of positive nonlinear systems using mixed integer programming
The reaction kinetic realizations of nonnegative polynomial systems are studied in this paper. It is brie y reviewed that a wide class of positive systems can be written in or simply transformed to kinetic form. Based on the structure of kinetic realizations, valuable information can be obtained about the dynamical properties of the investigated systems using the results of chemical reaction ne...
متن کاملComputing balanced realizations for nonlinear systems
In 1993, Scherpen generalized the balanced truncation method to the nonlinear setting. However, the Scherpen procedure is not easily computable and has not yet been applied in practice. We offer methods, tools, and algorithms for computing the energy functions and coordinate transformations involved in the Scherpen theory and procedure for nonlinear balancing. We then apply our approach to deri...
متن کاملOn computing minimal realizations of periodic descriptor systems
We propose computationally efficient and numerically reliable algorithms to compute minimal realizations of periodic descriptor systems. The main computational tool employed for the structural analysis of periodic descriptor systems (i.e., reachability and observability) is the orthogonal reduction of periodic matrix pairs to Kronecker-like forms. Specializations of a general reduction algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems & Control Letters
سال: 2015
ISSN: 0167-6911
DOI: 10.1016/j.sysconle.2015.05.001